Total Coloring Conjecture for Certain Classes of Graphs
نویسندگان
چکیده
منابع مشابه
Total Coloring of Certain Double Vertex Graphs
In this paper we investigate the total coloring number for double vertex graphs of some of the most common classes of graphs. Mathematics Subject Classification: 05C15
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملTotal Vertex Irregularity Strength of Certain Classes of Unicyclic Graphs *
A total vertex irregular k-labeling φ of a graph G is a labeling of the vertices and edges of G with labels from the set {1, 2, . . . , k} in such a way that for any two different vertices x and y their weights wt(x) and wt(y) are distinct. Here, the weight of a vertex x in G is the sum of the label of x and the labels of all edges incident with the vertex x. The minimum k for which the graph G...
متن کاملEdge-Coloring and f-Coloring for Various Classes of Graphs
In an ordinary edge-coloring of a graph each color appears at each vertex at most once. An f -coloring is a generalized edge-coloring in which each color appears at each vertex v at most f(v) times where f(v) is a positive integer assigned to v. This paper gives efficient sequential and parallel algorithms to find ordinary edge-colorings and f -colorings for various classes of graphs such as bi...
متن کاملTotal Game Coloring of Graphs
Total variant of well known graph coloring game is considered. We determine exact values of χ ′′ g for some classes of graphs and show that total game chromatic number is bounded from above by ∆ + 3∆ +. We also show relation between total game coloring number and game coloring index.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2018
ISSN: 1999-4893
DOI: 10.3390/a11100161